Algorithms for optimal dyadic decision trees
نویسندگان
چکیده
منابع مشابه
Technical Note: Algorithms for Optimal Dyadic Decision Trees
A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, replacing the dynamic programming alg...
متن کاملDyadic Decision Trees
These notes introduce a new kind of classifier called a dyadic decision tree (DDT). We also introduce a discrimination rule for learning a DDT that achieves the optimal rate of convergence, ER(ĥn) − R∗ = O(n−1/d), for the box-counting class, which was defined in the previous set of notes. This improves on the rate of ER(ĥn)−R = O(n−1/(d+2)) for the histogram sieve estimator from the previous no...
متن کاملApproximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
We consider the problem of constructing optimal decision trees: given a collection of tests which can disambiguate between a set of m possible diseases, each test having a cost, and the a-priori likelihood of the patient having any particular disease, what is a good adaptive strategy to perform these tests to minimize the expected cost to identify the disease? We settle the approximability of t...
متن کاملOptimal decision trees for local image processing algorithms
In this paper we present a novel algorithm to synthesize an optimal decision tree from OR-decision tables, an extension of standard decision tables, complete with the formal proof of optimality and computational cost analysis. As many problems which require to recognize particular patterns can be modeled with this formalism, we select two common binary image processing algorithms, namely connec...
متن کاملAdaptive Minimax Classification with Dyadic Decision Trees
Decision trees are surprisingly adaptive in four important respects: They automatically (1) adapt to Tsybakov’s “noise” condition; (2) focus on data distributed on lower dimensional manifolds; (3) reject irrelevant features; (4) adapt to Bayes decision boundary smoothness. In this paper we examine a decision tree based on dyadic splits that adapts to each of these conditions to achieve minimax ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2010
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-010-5167-x